Eventual Extensions of Finite Codes
نویسندگان
چکیده
منابع مشابه
Eventual Extensions of Finite Codes
Suppose S and T are shift equivalent mixing shifts of finite type, and / is a conjugacy from a subsystem of S to a subsystem of T. Then for any sufficiently large n, f extends to a conjugacy of Sn and Tn. A consequence of the proof is a fortified version of Wagoner's Stable FOG Theorem. Recall [Wi] that a nonnegative integral matrix A is the adjacency matrix of a directed graph whose arc set is...
متن کاملOptimum Extensions of Prefix Codes
An algorithm is given for finding the minimum weight extension of a prefix code. The algorithm runs in 0(n3), where n is the number of codewords to be added, and works for arbitrary alphabets. For binary alphabets the running time is reduced to O(n*), by using the fact that a certain cost matrix satisfies the quadrangle inequality. The quadrangle inequality is shown not to hold for alphabets of...
متن کاملExtensions of covariantly finite subcategories
Gentle and Todorov proved that in an abelian category with enough projective objects, the extension subcategory of two covariantly finite subcategories is covariantly finite. We give an example to show that Gentle–Todorov’s theorem may fail in an arbitrary abelian category; however we prove a triangulated version of Gentle–Todorov’s theorem which holds for arbitrary triangulated categories; we ...
متن کاملCodes from Cubic Curves and their Extensions
We study the linear codes and their extensions associated with sets of points in the plane corresponding to cubic curves. Instead of merely studying linear extensions, all possible extensions of the code are studied. In this way several new results are obtained and some existing results are strengthened. This type of analysis was carried out by Alderson, Bruen, and Silverman [J. Combin. Theory ...
متن کاملAlgebraic Geometric codes from Kummer Extensions
In the early eighties tools from algebraic geometry were applied by V. Goppa to construct linear codes using algebraic curves over finite fields, see [7]. Nowadays these codes are called algebraic-geometric codes, AG codes for short. The starting point in the construction of an AG code is a projective, absolutely irreducible, non singular algebraic curve X of genus g ≥ 1 defined over the finite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1988
ISSN: 0002-9939
DOI: 10.2307/2046823